SHAKEDOWN OF BOLTS WITH A ONE-SIDED PROPAGATING CRACK

One-Sided Interval Trees

We give an alternative treatment and extension of some results of Itoh and Mahmoud on one-sided interval trees. The proofs are based on renewal theory, including a case with mixed multiplicative and additive renewals.

A One-sided Matching with Dynamic Preferences

In recent years, the problem of allocating indivisible resources to self-interested agents has generated an interesting, rich interplay at the interface of computer science, economics, and game theory. Most theoretical frameworks and empirical studies for resource allocation encompass a wide range of desirable economic properties such as efficiency, truthfulness, and fairness. In addition, a br...

Popular Matchings with Two-Sided Preferences and One-Sided Ties

We are given a bipartite graph G = (A ∪ B,E) where each vertex has a preference list ranking its neighbors: in particular, every a ∈ A ranks its neighbors in a strict order of preference, whereas the preference lists of b ∈ B may contain ties. A matching M is popular if there is no matching M ′ such that the number of vertices that prefer M ′ to M exceeds the number that prefer M to M ′. We sho...

On One-Sided Ideals of Rings of Linear Transformations

A One-Sided Zimin Construction

A string is Abelian square-free if it contains no Abelian squares; that is, adjacent substrings which are permutations of each other. An Abelian square-free string is maximal if it cannot be extended to the left or right by concatenating alphabet symbols without introducing an Abelian square. We construct Abelian square-free finite strings which are maximal by modifying a construction of Zimin....